Acceleration of FDTD mode solver by high-performance computing techniques

High Performance Computing with a Conservative Spectral Boltzmann Solver

We present new results building on the conservative deterministic spectral method for the space inhomogeneous Boltzmann equation developed by Gamba and Tharkabhushaman. This approach is a twostep process that acts on the weak form of the Boltzmann equation, and uses the machinery of the Fourier transform to reformulate the collisional integral into a weighted convolution in Fourier space. A con...

Innovative Autocalibration Techniques Using High Performance Computing

We compare the computational effectiveness of two different approaches to the autocalibration of environmental models: algorithms based on gridding the input parameter set; and genetic or evolutionary algorithms (GAs). Dramatic steps were taken to reduce the total run-time per simulation of the selected complex model in the calibration phase: a model that takes a few seconds per run can be cali...

High-Performance Computing Techniques for Record Linkage

The task of linking together information from one or more data sources representing the same entity (patient, customer, provider, business, etc.) If no unique identifier is available, probabilistic linkage techniques have to be applied Applications of record linkage Remove duplicates in a data set (internal linkage) Merge new records into a larger master data set Create patient oriented statist...

Techniques for Optimizing Applications: High Performance Computing

High performance simplex solver

The dual simplex method is frequently the most efficient technique for solving linear programming (LP) problems. This thesis describes an efficient implementation of the sequential dual simplex method and the design and development of two parallel dual simplex solvers. In serial, many advanced techniques for the (dual) simplex method are implemented, including sparse LU factorization, hyper-spa...